基于扩展H∞滤波的OFDM自适应盲信道估计算法

针对OFDM系统中的信道估计问题,提出了一种基于扩展H∞滤波的OFDM自适应盲信道估计方法。该方法通过对常规H∞算法进行改进,实现了在OFDM系统中能自适应跟踪信道的变化特征,从而使均方误差的性能随着输入信噪比的增加得到很大的提高。仿真结果也验证了该算法优于卡尔曼和H∞估计算法,具有计算复杂度低,运算量小、收敛速度快、算法灵活等特性。     

基于SCAS的防空反导装备体系作战能力指标设计

指标设计是进行武器装备体系发展论证和作战效能与作战能力评估分析的基础。着眼体系作战效能与作战能力评估分析需求,基于传感器（ Sensor）、控制器（ Controller）、执行器（ Actuator）、支持器（ Supporter）的柔性建模方法,对防空反导装备体系作战能力指标进行了设计,构建了其侦察预警能力、指挥控制能力、拦截打击能力、综合保障能力评估指标体系,并利用结构方程模型（ SEM）对指标之间的影响作用关系进行了分析,可为防空反导装备体系建设与运用提供重要借鉴。     

Advancing “Defence-in-depth”: intelligence and systems dynamics

This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain.     

用毁伤概率指标优化二点源诱饵系统布阵

两点源诱偏系统是应用有源干扰的方式,利用反辐射导弹(ARM)本身的缺陷来对反辐射导弹的导引头进行干扰,从而达到保护主战雷达目的的一种有源干扰系统。主要从反辐射导弹的基本原理和有源诱偏的概念入手,对两点源诱偏系统进行理论推导、数学建模、布站设想,后引入毁伤概率指标对各种布站方式进行分类、仿真,对每一种仿真结果进行分析、评估,再把各种分析结果加以比较,从中找出最佳的布站方式。最后利用以上的分析结果,得出几点有用的结论。     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Puzzle‐based storage systems

We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于冗余的复杂体系动态适应性结构设计研究

针对复杂体系动态适应性研究所存在的问题,提出了复杂体系冗余概念和基于冗余的复杂体系动态适应性结构设计思想,讨论了基于冗余的复杂体系动态博弈设计过程及体系结构;在此基础上,根据复杂体系使命目标的执行特点及体系本身的结构特性,详细地阐述了复杂体系中的任务冗余、系统冗余和结构冗余三种冗余类型,并从冗余切换方式、冗余具体内容和冗余表现性质三个方面论述了复杂体系中各种冗余所组成的冗余体系,指出冗余体系是复杂体系适应环境的一种策略,也是复杂体系不断演化的需要和结果,并且能够为复杂体系动态适应性结构的构建及其效能评估和复杂体系的优化及改进等研究提供一定的理论指导。     

Transient analysis of Markov models of fault‐tolerant systems with deferred repair using split regenerative randomization

The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C₂, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C₂ model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests

While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006